Extended howze-pearson compensators in block decoupling problems.
نویسندگان
چکیده
منابع مشابه
Block-Decoupling Multivariate Polynomials Using the Tensor Block-Term Decomposition
We present a tensor-based method to decompose a given set of multivariate functions into linear combinations of a set of multivariate functions of linear forms of the input variables. The method proceeds by forming a three-way array (tensor) by stacking Jacobian matrix evaluations of the function behind each other. It is shown that a blockterm decomposition of this tensor provides the necessary...
متن کاملLocation problems in regions with and block norms
We consider the two well knownminimax and minisum single facility location problems in the plane which has been divided into two regions, and by a straight line. The two regions are measured by various norms . We focus on three special cases in which the regions and are measured by and norms, and block norms, two distinct block norms. Based on the properties of block norms then we use linear ...
متن کاملeXtended Block Cache
This paper describes a new instruction-supply mechanism, called the eXtended Block Cache (XBC). The goal of the XBC is to improve on the Trace Cache (TC) hit rate, while providing the same bandwidth. The improved hit rate is achieved by having the XBC a nearly redundant free structure. The basic unit recorded in the XBC is the extended block (XB), which is a multiple-entry single-exit instructi...
متن کاملDistributed Decoupling of Multiagent Simple Temporal Problems
We propose a new distributed algorithm for decoupling the Multiagent Simple Temporal Network (MaSTN) problem. The agents cooperatively decouple the MaSTN while simultaneously optimizing a sum of concave objectives local to each agent. Several schedule flexibility measures are applicable in this framework. We pose the MaSTN decoupling problem as a distributed convex optimization problem subject ...
متن کاملBlock-Restricted Reordering - Extended Experiments
Ordered Binary Decision Diagrams (OBDDs) are so far the most eecient representation scheme for manipulation of Boolean functions in computer-aided design and veriication of digital systems. The concise-ness of an OBDD representation depends on the choice of the variable ordering, and the minimization problem that can be formulated as the problem of nding an ordering that minimizse the OBDD size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1987
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.53.2555